On a lower bound of Jensen’s functional
نویسندگان
چکیده
منابع مشابه
the effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولA lower bound on IMMSE �
This paper provides upper and lower bounds on the information rates achievable with a minimum mean square error (MMSE) Tomlinson-Harashima precoder (THP) assuming ideal interleaving. We also give an exact formula for zero-forcing (ZF) THP achievable information rates. At high SNR, the performance of the MMSE-THP and the ZF-THP identically suuer only the 2.55 bit or 1.53 dB \shaping" loss from c...
متن کاملLower Bound on Testing
We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA Lower Bound on Opaque Sets
We prove a lower bound of 2.00002 on the the total length of a set (of curves) that intersects every line that intersects the unit square. The best known lower bound has been 2, established by Jones in 1964.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publikacije Elektrotehnickog fakulteta - serija: matematika
سال: 2002
ISSN: 0353-8893
DOI: 10.2298/petf0213096p